./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-92.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db7e34f2918099ed247bc16b9e72d475a3cee192a5442b3d6ce0ab581818cdfc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:49:31,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:49:32,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:49:32,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:49:32,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:49:32,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:49:32,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:49:32,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:49:32,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:49:32,079 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:49:32,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:49:32,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:49:32,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:49:32,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:49:32,082 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:49:32,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:49:32,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:49:32,083 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:49:32,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:49:32,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:49:32,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:49:32,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:49:32,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:49:32,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:49:32,087 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:49:32,087 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:49:32,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:49:32,088 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:49:32,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:49:32,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:49:32,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:49:32,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:49:32,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:49:32,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:49:32,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:49:32,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:49:32,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:49:32,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:49:32,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:49:32,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:49:32,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:49:32,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:49:32,091 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db7e34f2918099ed247bc16b9e72d475a3cee192a5442b3d6ce0ab581818cdfc [2024-11-10 03:49:32,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:49:32,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:49:32,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:49:32,337 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:49:32,337 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:49:32,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-92.i [2024-11-10 03:49:33,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:49:33,946 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:49:33,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-92.i [2024-11-10 03:49:33,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8247df07e/e35d20a5808441dbacf378b191effeed/FLAGfb28975bb [2024-11-10 03:49:33,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8247df07e/e35d20a5808441dbacf378b191effeed [2024-11-10 03:49:33,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:49:33,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:49:33,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:49:33,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:49:33,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:49:33,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:49:33" (1/1) ... [2024-11-10 03:49:33,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f55618b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:33, skipping insertion in model container [2024-11-10 03:49:33,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:49:33" (1/1) ... [2024-11-10 03:49:34,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:49:34,171 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-92.i[913,926] [2024-11-10 03:49:34,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:49:34,252 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:49:34,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-92.i[913,926] [2024-11-10 03:49:34,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:49:34,315 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:49:34,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:34 WrapperNode [2024-11-10 03:49:34,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:49:34,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:49:34,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:49:34,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:49:34,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:34" (1/1) ... [2024-11-10 03:49:34,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:34" (1/1) ... [2024-11-10 03:49:34,390 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 164 [2024-11-10 03:49:34,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:49:34,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:49:34,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:49:34,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:49:34,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:34" (1/1) ... [2024-11-10 03:49:34,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:34" (1/1) ... [2024-11-10 03:49:34,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:34" (1/1) ... [2024-11-10 03:49:34,435 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:49:34,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:34" (1/1) ... [2024-11-10 03:49:34,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:34" (1/1) ... [2024-11-10 03:49:34,443 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:34" (1/1) ... [2024-11-10 03:49:34,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:34" (1/1) ... [2024-11-10 03:49:34,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:34" (1/1) ... [2024-11-10 03:49:34,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:34" (1/1) ... [2024-11-10 03:49:34,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:49:34,451 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:49:34,452 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:49:34,452 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:49:34,453 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:34" (1/1) ... [2024-11-10 03:49:34,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:49:34,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:49:34,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:49:34,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:49:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:49:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:49:34,539 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:49:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:49:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:49:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:49:34,613 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:49:34,615 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:49:34,849 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L134: havoc property_#t~bitwise16#1;havoc property_#t~short17#1; [2024-11-10 03:49:34,891 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 03:49:34,895 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:49:34,914 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:49:34,915 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:49:34,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:49:34 BoogieIcfgContainer [2024-11-10 03:49:34,916 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:49:34,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:49:34,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:49:34,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:49:34,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:49:33" (1/3) ... [2024-11-10 03:49:34,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29add7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:49:34, skipping insertion in model container [2024-11-10 03:49:34,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:34" (2/3) ... [2024-11-10 03:49:34,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29add7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:49:34, skipping insertion in model container [2024-11-10 03:49:34,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:49:34" (3/3) ... [2024-11-10 03:49:34,926 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-92.i [2024-11-10 03:49:34,941 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:49:34,941 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:49:34,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:49:34,994 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;@4c352206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:49:34,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:49:34,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 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-11-10 03:49:35,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 03:49:35,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:49:35,013 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:49:35,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:49:35,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:49:35,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1298534863, now seen corresponding path program 1 times [2024-11-10 03:49:35,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:49:35,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777717075] [2024-11-10 03:49:35,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:49:35,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:49:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:49:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:49:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:49:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:49:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:49:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:49:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:49:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:49:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:49:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:49:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:49:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:49:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:49:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:49:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 03:49:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:49:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:49:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:49:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:49:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:49:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:49:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:49:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 03:49:35,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:49:35,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777717075] [2024-11-10 03:49:35,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777717075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:49:35,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:49:35,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:49:35,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001290077] [2024-11-10 03:49:35,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:49:35,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:49:35,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:49:35,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:49:35,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:49:35,517 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 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 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-11-10 03:49:35,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:49:35,566 INFO L93 Difference]: Finished difference Result 142 states and 239 transitions. [2024-11-10 03:49:35,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:49:35,570 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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 143 [2024-11-10 03:49:35,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:49:35,580 INFO L225 Difference]: With dead ends: 142 [2024-11-10 03:49:35,580 INFO L226 Difference]: Without dead ends: 70 [2024-11-10 03:49:35,586 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-11-10 03:49:35,590 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:49:35,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:49:35,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-10 03:49:35,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-10 03:49:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 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-11-10 03:49:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 104 transitions. [2024-11-10 03:49:35,637 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 104 transitions. Word has length 143 [2024-11-10 03:49:35,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:49:35,638 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 104 transitions. [2024-11-10 03:49:35,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-11-10 03:49:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 104 transitions. [2024-11-10 03:49:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 03:49:35,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:49:35,644 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:49:35,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:49:35,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:49:35,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:49:35,646 INFO L85 PathProgramCache]: Analyzing trace with hash -199781581, now seen corresponding path program 1 times [2024-11-10 03:49:35,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:49:35,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103213106] [2024-11-10 03:49:35,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:49:35,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:49:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:49:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:49:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:49:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:49:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:49:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:49:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:49:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:49:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:49:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:49:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:49:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:49:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:49:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:49:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 03:49:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:49:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:49:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:49:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:49:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:49:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:49:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:49:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 03:49:36,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:49:36,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103213106] [2024-11-10 03:49:36,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103213106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:49:36,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:49:36,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:49:36,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693374270] [2024-11-10 03:49:36,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:49:36,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:49:36,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:49:36,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:49:36,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:49:36,363 INFO L87 Difference]: Start difference. First operand 70 states and 104 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-11-10 03:49:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:49:36,626 INFO L93 Difference]: Finished difference Result 221 states and 327 transitions. [2024-11-10 03:49:36,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:49:36,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 143 [2024-11-10 03:49:36,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:49:36,628 INFO L225 Difference]: With dead ends: 221 [2024-11-10 03:49:36,628 INFO L226 Difference]: Without dead ends: 154 [2024-11-10 03:49:36,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:49:36,632 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 102 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:49:36,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 349 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:49:36,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-10 03:49:36,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 135. [2024-11-10 03:49:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 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-11-10 03:49:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 204 transitions. [2024-11-10 03:49:36,662 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 204 transitions. Word has length 143 [2024-11-10 03:49:36,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:49:36,662 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 204 transitions. [2024-11-10 03:49:36,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-11-10 03:49:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 204 transitions. [2024-11-10 03:49:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 03:49:36,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:49:36,664 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:49:36,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:49:36,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:49:36,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:49:36,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1330769808, now seen corresponding path program 1 times [2024-11-10 03:49:36,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:49:36,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059496907] [2024-11-10 03:49:36,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:49:36,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:49:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:49:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:49:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:49:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:49:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:49:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:49:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:49:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:49:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:49:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:49:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:49:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:49:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:49:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:49:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 03:49:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:49:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:49:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:49:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:49:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:49:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:49:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:49:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 03:49:37,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:49:37,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059496907] [2024-11-10 03:49:37,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059496907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:49:37,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:49:37,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 03:49:37,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550896371] [2024-11-10 03:49:37,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:49:37,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 03:49:37,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:49:37,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 03:49:37,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:49:37,674 INFO L87 Difference]: Start difference. First operand 135 states and 204 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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-11-10 03:49:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:49:37,965 INFO L93 Difference]: Finished difference Result 348 states and 522 transitions. [2024-11-10 03:49:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:49:37,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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 144 [2024-11-10 03:49:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:49:37,971 INFO L225 Difference]: With dead ends: 348 [2024-11-10 03:49:37,973 INFO L226 Difference]: Without dead ends: 216 [2024-11-10 03:49:37,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:49:37,975 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 72 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:49:37,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 308 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:49:37,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-10 03:49:38,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 195. [2024-11-10 03:49:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 125 states have (on average 1.296) internal successors, (162), 125 states have internal predecessors, (162), 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-11-10 03:49:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 294 transitions. [2024-11-10 03:49:38,012 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 294 transitions. Word has length 144 [2024-11-10 03:49:38,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:49:38,013 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 294 transitions. [2024-11-10 03:49:38,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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-11-10 03:49:38,013 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 294 transitions. [2024-11-10 03:49:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 03:49:38,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:49:38,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:49:38,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:49:38,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:49:38,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:49:38,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1181891506, now seen corresponding path program 1 times [2024-11-10 03:49:38,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:49:38,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850714136] [2024-11-10 03:49:38,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:49:38,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:49:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:49:38,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425828189] [2024-11-10 03:49:38,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:49:38,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:49:38,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:49:38,072 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:49:38,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 03:49:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:49:38,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:49:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:49:38,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:49:38,357 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:49:38,358 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:49:38,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 03:49:38,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:49:38,563 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 03:49:38,687 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:49:38,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:49:38 BoogieIcfgContainer [2024-11-10 03:49:38,691 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:49:38,692 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:49:38,692 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:49:38,692 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:49:38,692 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:49:34" (3/4) ... [2024-11-10 03:49:38,694 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:49:38,695 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:49:38,696 INFO L158 Benchmark]: Toolchain (without parser) took 4716.26ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 70.1MB in the beginning and 107.3MB in the end (delta: -37.1MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2024-11-10 03:49:38,696 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:49:38,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.86ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 54.2MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 03:49:38,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.91ms. Allocated memory is still 142.6MB. Free memory was 54.0MB in the beginning and 111.8MB in the end (delta: -57.8MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-11-10 03:49:38,698 INFO L158 Benchmark]: Boogie Preprocessor took 59.18ms. Allocated memory was 142.6MB in the beginning and 190.8MB in the end (delta: 48.2MB). Free memory was 111.7MB in the beginning and 157.7MB in the end (delta: -46.0MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-11-10 03:49:38,698 INFO L158 Benchmark]: IcfgBuilder took 464.86ms. Allocated memory is still 190.8MB. Free memory was 157.7MB in the beginning and 132.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 03:49:38,698 INFO L158 Benchmark]: TraceAbstraction took 3772.83ms. Allocated memory was 190.8MB in the beginning and 243.3MB in the end (delta: 52.4MB). Free memory was 131.5MB in the beginning and 108.3MB in the end (delta: 23.2MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. [2024-11-10 03:49:38,698 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 243.3MB. Free memory was 108.3MB in the beginning and 107.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 03:49:38,702 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 142.6MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.86ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 54.2MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.91ms. Allocated memory is still 142.6MB. Free memory was 54.0MB in the beginning and 111.8MB in the end (delta: -57.8MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.18ms. Allocated memory was 142.6MB in the beginning and 190.8MB in the end (delta: 48.2MB). Free memory was 111.7MB in the beginning and 157.7MB in the end (delta: -46.0MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * IcfgBuilder took 464.86ms. Allocated memory is still 190.8MB. Free memory was 157.7MB in the beginning and 132.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3772.83ms. Allocated memory was 190.8MB in the beginning and 243.3MB in the end (delta: 52.4MB). Free memory was 131.5MB in the beginning and 108.3MB in the end (delta: 23.2MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 243.3MB. Free memory was 108.3MB in the beginning and 107.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 134. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 100; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] unsigned short int var_1_8 = 10; [L26] unsigned short int var_1_9 = 0; [L27] unsigned short int var_1_10 = 53946; [L28] unsigned short int var_1_11 = 1; [L29] unsigned long int var_1_12 = 8; [L30] double var_1_13 = 8.25; [L31] signed long int var_1_14 = -256; [L32] double var_1_15 = 0.19999999999999996; [L33] signed long int var_1_16 = -16; [L34] signed char var_1_17 = 1; [L35] signed char var_1_18 = 4; [L36] signed char var_1_19 = 64; [L37] signed long int var_1_20 = 1; [L38] signed long int var_1_21 = 1000000000; [L39] unsigned short int last_1_var_1_1 = 100; [L40] unsigned long int last_1_var_1_12 = 8; [L41] double last_1_var_1_13 = 8.25; [L42] signed long int last_1_var_1_16 = -16; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L138] isInitial = 1 [L139] FCALL initially() [L140] COND TRUE 1 [L141] CALL updateLastVariables() [L128] last_1_var_1_1 = var_1_1 [L129] last_1_var_1_12 = var_1_12 [L130] last_1_var_1_13 = var_1_13 [L131] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L141] RET updateLastVariables() [L142] CALL updateVariables() [L93] var_1_6 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_7=0, var_1_8=10, var_1_9=0] [L94] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_7=0, var_1_8=10, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L95] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L96] var_1_7 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_8=10, var_1_9=0] [L97] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_8=10, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L98] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L99] var_1_8 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_9=0] [L100] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_9=0] [L101] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L101] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L102] var_1_9 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769] [L103] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769] [L104] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L104] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L105] var_1_10 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L106] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L107] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L107] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L108] var_1_11 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L109] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L110] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L110] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L111] var_1_14 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L112] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L113] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L113] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L114] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L114] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L115] var_1_15 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L116] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L117] var_1_18 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L118] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L119] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L119] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L120] var_1_19 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_19 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L121] RET assume_abort_if_not(var_1_19 >= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L122] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L122] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L123] var_1_21 = __VERIFIER_nondet_long() [L124] CALL assume_abort_if_not(var_1_21 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L124] RET assume_abort_if_not(var_1_21 >= 536870911) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L125] CALL assume_abort_if_not(var_1_21 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L125] RET assume_abort_if_not(var_1_21 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L142] RET updateVariables() [L143] CALL step() [L46] unsigned char stepLocal_0 = last_1_var_1_13 >= last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_0=0, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L47] COND FALSE !((last_1_var_1_12 == last_1_var_1_1) && stepLocal_0) [L58] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L60] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L60] COND TRUE (((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16 [L61] COND TRUE \read(var_1_7) [L62] var_1_12 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L65] var_1_17 = (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1))))) [L66] unsigned long int stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L67] COND TRUE \read(var_1_6) [L68] var_1_20 = ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L76] unsigned char stepLocal_3 = var_1_6; [L77] unsigned char stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_2=1, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L78] COND FALSE !(stepLocal_2 && (var_1_9 < (var_1_10 + var_1_20))) [L83] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=32767, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L85] signed long int stepLocal_1 = ((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14); VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_1=32767, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=32767, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L86] COND TRUE stepLocal_1 >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8))) [L87] var_1_13 = var_1_15 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=32767, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L143] RET step() [L144] CALL, EXPR property() [L134] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=32767, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L134] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=32767, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L134] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=32767, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L134-L135] return (((((((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1)) && (((((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14)) >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8)))) ? (var_1_13 == ((double) var_1_15)) : (var_1_13 == ((double) var_1_15)))) && ((var_1_6 && (var_1_9 < (var_1_10 + var_1_20))) ? ((var_1_7 && var_1_6) ? (var_1_16 == ((signed long int) var_1_10)) : 1) : (var_1_16 == ((signed long int) var_1_8)))) && (var_1_17 == ((signed char) (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1)))))))) && (var_1_6 ? (var_1_20 == ((signed long int) ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10))) : (((~ var_1_19) == var_1_12) ? (var_1_20 == ((signed long int) var_1_1)) : (var_1_20 == ((signed long int) var_1_10)))) ; [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=32767, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=32767, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 174 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 759 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 462 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 267 IncrementalHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 297 mSDtfsCounter, 267 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 722 NumberOfCodeBlocks, 722 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 427 ConstructedInterpolants, 0 QuantifiedInterpolants, 2238 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2772/2772 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 03:49:38,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-92.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db7e34f2918099ed247bc16b9e72d475a3cee192a5442b3d6ce0ab581818cdfc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:49:40,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:49:40,906 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:49:40,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:49:40,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:49:40,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:49:40,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:49:40,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:49:40,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:49:40,949 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:49:40,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:49:40,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:49:40,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:49:40,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:49:40,952 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:49:40,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:49:40,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:49:40,953 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:49:40,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:49:40,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:49:40,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:49:40,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:49:40,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:49:40,957 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:49:40,957 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:49:40,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:49:40,958 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:49:40,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:49:40,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:49:40,958 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:49:40,958 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:49:40,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:49:40,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:49:40,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:49:40,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:49:40,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:49:40,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:49:40,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:49:40,959 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:49:40,960 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:49:40,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:49:40,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:49:40,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:49:40,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:49:40,961 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db7e34f2918099ed247bc16b9e72d475a3cee192a5442b3d6ce0ab581818cdfc [2024-11-10 03:49:41,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:49:41,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:49:41,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:49:41,244 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:49:41,245 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:49:41,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-92.i [2024-11-10 03:49:42,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:49:42,827 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:49:42,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-92.i [2024-11-10 03:49:42,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f80e1285b/43f60f36d3fd4bf3a1a029429c979397/FLAG814ef9482 [2024-11-10 03:49:42,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f80e1285b/43f60f36d3fd4bf3a1a029429c979397 [2024-11-10 03:49:42,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:49:42,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:49:42,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:49:42,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:49:42,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:49:42,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:49:42" (1/1) ... [2024-11-10 03:49:42,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e5b0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:42, skipping insertion in model container [2024-11-10 03:49:42,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:49:42" (1/1) ... [2024-11-10 03:49:42,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:49:43,061 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-92.i[913,926] [2024-11-10 03:49:43,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:49:43,143 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:49:43,155 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-92.i[913,926] [2024-11-10 03:49:43,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:49:43,208 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:49:43,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:43 WrapperNode [2024-11-10 03:49:43,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:49:43,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:49:43,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:49:43,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:49:43,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:43" (1/1) ... [2024-11-10 03:49:43,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:43" (1/1) ... [2024-11-10 03:49:43,264 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-11-10 03:49:43,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:49:43,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:49:43,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:49:43,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:49:43,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:43" (1/1) ... [2024-11-10 03:49:43,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:43" (1/1) ... [2024-11-10 03:49:43,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:43" (1/1) ... [2024-11-10 03:49:43,300 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:49:43,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:43" (1/1) ... [2024-11-10 03:49:43,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:43" (1/1) ... [2024-11-10 03:49:43,311 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:43" (1/1) ... [2024-11-10 03:49:43,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:43" (1/1) ... [2024-11-10 03:49:43,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:43" (1/1) ... [2024-11-10 03:49:43,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:43" (1/1) ... [2024-11-10 03:49:43,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:49:43,325 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:49:43,325 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:49:43,325 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:49:43,329 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:43" (1/1) ... [2024-11-10 03:49:43,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:49:43,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:49:43,361 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:49:43,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:49:43,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:49:43,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:49:43,401 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:49:43,401 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:49:43,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:49:43,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:49:43,469 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:49:43,471 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:49:43,732 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 03:49:43,732 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:49:43,745 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:49:43,746 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:49:43,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:49:43 BoogieIcfgContainer [2024-11-10 03:49:43,747 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:49:43,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:49:43,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:49:43,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:49:43,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:49:42" (1/3) ... [2024-11-10 03:49:43,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c0dfea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:49:43, skipping insertion in model container [2024-11-10 03:49:43,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:49:43" (2/3) ... [2024-11-10 03:49:43,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c0dfea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:49:43, skipping insertion in model container [2024-11-10 03:49:43,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:49:43" (3/3) ... [2024-11-10 03:49:43,757 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-92.i [2024-11-10 03:49:43,772 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:49:43,772 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:49:43,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:49:43,841 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;@12801f6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:49:43,845 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:49:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 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-11-10 03:49:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 03:49:43,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:49:43,863 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, 1, 1, 1, 1] [2024-11-10 03:49:43,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:49:43,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:49:43,869 INFO L85 PathProgramCache]: Analyzing trace with hash -658115912, now seen corresponding path program 1 times [2024-11-10 03:49:43,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:49:43,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817421958] [2024-11-10 03:49:43,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:49:43,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:49:43,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:49:43,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:49:43,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:49:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:44,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:49:44,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:49:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2024-11-10 03:49:44,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:49:44,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:49:44,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817421958] [2024-11-10 03:49:44,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817421958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:49:44,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:49:44,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:49:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632194027] [2024-11-10 03:49:44,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:49:44,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:49:44,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:49:44,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:49:44,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:49:44,204 INFO L87 Difference]: Start difference. First operand has 68 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 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 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-11-10 03:49:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:49:44,245 INFO L93 Difference]: Finished difference Result 128 states and 219 transitions. [2024-11-10 03:49:44,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:49:44,247 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 140 [2024-11-10 03:49:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:49:44,253 INFO L225 Difference]: With dead ends: 128 [2024-11-10 03:49:44,253 INFO L226 Difference]: Without dead ends: 63 [2024-11-10 03:49:44,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:49:44,258 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:49:44,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:49:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-10 03:49:44,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-10 03:49:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 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-11-10 03:49:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 94 transitions. [2024-11-10 03:49:44,295 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 94 transitions. Word has length 140 [2024-11-10 03:49:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:49:44,295 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 94 transitions. [2024-11-10 03:49:44,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-11-10 03:49:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 94 transitions. [2024-11-10 03:49:44,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 03:49:44,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:49:44,298 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, 1, 1, 1, 1] [2024-11-10 03:49:44,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 03:49:44,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:49:44,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:49:44,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:49:44,504 INFO L85 PathProgramCache]: Analyzing trace with hash 29900022, now seen corresponding path program 1 times [2024-11-10 03:49:44,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:49:44,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419267383] [2024-11-10 03:49:44,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:49:44,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:49:44,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:49:44,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:49:44,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:49:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:44,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 03:49:44,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:49:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 03:49:44,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:49:44,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:49:44,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419267383] [2024-11-10 03:49:44,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419267383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:49:44,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:49:44,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:49:44,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955267710] [2024-11-10 03:49:44,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:49:45,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:49:45,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:49:45,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:49:45,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:49:45,001 INFO L87 Difference]: Start difference. First operand 63 states and 94 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-11-10 03:49:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:49:45,177 INFO L93 Difference]: Finished difference Result 194 states and 288 transitions. [2024-11-10 03:49:45,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:49:45,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 140 [2024-11-10 03:49:45,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:49:45,181 INFO L225 Difference]: With dead ends: 194 [2024-11-10 03:49:45,181 INFO L226 Difference]: Without dead ends: 134 [2024-11-10 03:49:45,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:49:45,185 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 75 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:49:45,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 270 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:49:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-10 03:49:45,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 120. [2024-11-10 03:49:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 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-11-10 03:49:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 182 transitions. [2024-11-10 03:49:45,222 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 182 transitions. Word has length 140 [2024-11-10 03:49:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:49:45,222 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 182 transitions. [2024-11-10 03:49:45,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-11-10 03:49:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 182 transitions. [2024-11-10 03:49:45,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 03:49:45,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:49:45,224 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, 1, 1, 1, 1, 1] [2024-11-10 03:49:45,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 03:49:45,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:49:45,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:49:45,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:49:45,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1679100978, now seen corresponding path program 1 times [2024-11-10 03:49:45,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:49:45,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973998357] [2024-11-10 03:49:45,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:49:45,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:49:45,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:49:45,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:49:45,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 03:49:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:49:45,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 03:49:45,694 INFO L278 TraceCheckSpWp]: Computing forward predicates...