./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu --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 64bit --witnessprinter.graph.data.programhash 7c314eef3d472fe4a1a0388d2c5f5a188709ac797267103fd11452d71371ead3 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:39:04,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:39:04,184 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-19 07:39:04,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:39:04,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:39:04,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:39:04,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:39:04,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:39:04,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:39:04,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:39:04,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:39:04,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:39:04,240 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:39:04,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:39:04,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:39:04,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:39:04,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:39:04,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:39:04,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:39:04,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:39:04,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:39:04,245 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:39:04,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:39:04,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:39:04,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:39:04,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:39:04,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:39:04,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:39:04,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:39:04,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:39:04,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:39:04,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:39:04,251 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:39:04,251 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:39:04,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:39:04,252 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:39:04,252 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c314eef3d472fe4a1a0388d2c5f5a188709ac797267103fd11452d71371ead3 [2023-11-19 07:39:04,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:39:04,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:39:04,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:39:04,550 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:39:04,551 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:39:04,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2023-11-19 07:39:07,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:39:07,983 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:39:07,983 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2023-11-19 07:39:07,991 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/data/f5a08e45c/2edf6db84223442698b9ef6803854e13/FLAG2af01e2a5 [2023-11-19 07:39:08,004 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/data/f5a08e45c/2edf6db84223442698b9ef6803854e13 [2023-11-19 07:39:08,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:39:08,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:39:08,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:39:08,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:39:08,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:39:08,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:39:08" (1/1) ... [2023-11-19 07:39:08,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44412126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:08, skipping insertion in model container [2023-11-19 07:39:08,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:39:08" (1/1) ... [2023-11-19 07:39:08,048 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:39:08,192 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c[1260,1273] [2023-11-19 07:39:08,236 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:39:08,248 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:39:08,260 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c[1260,1273] [2023-11-19 07:39:08,296 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:39:08,313 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:39:08,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:08 WrapperNode [2023-11-19 07:39:08,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:39:08,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:39:08,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:39:08,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:39:08,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:08" (1/1) ... [2023-11-19 07:39:08,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:08" (1/1) ... [2023-11-19 07:39:08,393 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 195 [2023-11-19 07:39:08,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:39:08,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:39:08,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:39:08,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:39:08,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:08" (1/1) ... [2023-11-19 07:39:08,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:08" (1/1) ... [2023-11-19 07:39:08,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:08" (1/1) ... [2023-11-19 07:39:08,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:08" (1/1) ... [2023-11-19 07:39:08,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:08" (1/1) ... [2023-11-19 07:39:08,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:08" (1/1) ... [2023-11-19 07:39:08,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:08" (1/1) ... [2023-11-19 07:39:08,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:08" (1/1) ... [2023-11-19 07:39:08,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:39:08,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:39:08,474 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:39:08,474 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:39:08,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:08" (1/1) ... [2023-11-19 07:39:08,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:39:08,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:08,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:39:08,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:39:08,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:39:08,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:39:08,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:39:08,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:39:08,719 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:39:08,722 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:39:09,137 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:39:09,145 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:39:09,145 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:39:09,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:09 BoogieIcfgContainer [2023-11-19 07:39:09,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:39:09,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:39:09,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:39:09,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:39:09,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:39:08" (1/3) ... [2023-11-19 07:39:09,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1489d653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:09, skipping insertion in model container [2023-11-19 07:39:09,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:08" (2/3) ... [2023-11-19 07:39:09,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1489d653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:09, skipping insertion in model container [2023-11-19 07:39:09,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:09" (3/3) ... [2023-11-19 07:39:09,161 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2023-11-19 07:39:09,183 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:39:09,183 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:39:09,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:39:09,236 INFO L357 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, mHoare=true, 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;@42d8477b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:39:09,236 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:39:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 07:39:09,248 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:09,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:09,249 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:09,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:09,255 INFO L85 PathProgramCache]: Analyzing trace with hash -313296464, now seen corresponding path program 1 times [2023-11-19 07:39:09,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:09,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232625860] [2023-11-19 07:39:09,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:09,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:09,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:09,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232625860] [2023-11-19 07:39:09,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232625860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:09,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:09,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:09,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565915668] [2023-11-19 07:39:09,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:09,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:09,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:09,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:09,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:09,925 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:09,986 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions. [2023-11-19 07:39:09,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:09,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-19 07:39:09,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:09,997 INFO L225 Difference]: With dead ends: 51 [2023-11-19 07:39:09,997 INFO L226 Difference]: Without dead ends: 27 [2023-11-19 07:39:10,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:10,008 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:10,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 99 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:10,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-19 07:39:10,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-19 07:39:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2023-11-19 07:39:10,054 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 15 [2023-11-19 07:39:10,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:10,055 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2023-11-19 07:39:10,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2023-11-19 07:39:10,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 07:39:10,057 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:10,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:10,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:39:10,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:10,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:10,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1120530784, now seen corresponding path program 1 times [2023-11-19 07:39:10,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:10,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479466915] [2023-11-19 07:39:10,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:10,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:10,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:10,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479466915] [2023-11-19 07:39:10,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479466915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:10,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:10,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:10,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431012048] [2023-11-19 07:39:10,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:10,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:10,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:10,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:10,210 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:10,236 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2023-11-19 07:39:10,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:10,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-19 07:39:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:10,238 INFO L225 Difference]: With dead ends: 52 [2023-11-19 07:39:10,238 INFO L226 Difference]: Without dead ends: 30 [2023-11-19 07:39:10,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:10,240 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:10,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:10,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-19 07:39:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2023-11-19 07:39:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2023-11-19 07:39:10,247 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 16 [2023-11-19 07:39:10,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:10,247 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2023-11-19 07:39:10,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2023-11-19 07:39:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 07:39:10,249 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:10,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:10,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:39:10,249 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:10,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:10,250 INFO L85 PathProgramCache]: Analyzing trace with hash -587148342, now seen corresponding path program 1 times [2023-11-19 07:39:10,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:10,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365921603] [2023-11-19 07:39:10,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:10,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:10,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:10,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365921603] [2023-11-19 07:39:10,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365921603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:10,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:10,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:39:10,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45570302] [2023-11-19 07:39:10,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:10,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:39:10,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:10,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:39:10,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:39:10,640 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:10,803 INFO L93 Difference]: Finished difference Result 81 states and 115 transitions. [2023-11-19 07:39:10,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:39:10,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-19 07:39:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:10,806 INFO L225 Difference]: With dead ends: 81 [2023-11-19 07:39:10,806 INFO L226 Difference]: Without dead ends: 57 [2023-11-19 07:39:10,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:39:10,816 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 84 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:10,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 115 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:10,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-19 07:39:10,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2023-11-19 07:39:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2023-11-19 07:39:10,834 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 17 [2023-11-19 07:39:10,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:10,835 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2023-11-19 07:39:10,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:10,838 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2023-11-19 07:39:10,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 07:39:10,840 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:10,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:10,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:39:10,841 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:10,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:10,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1187859020, now seen corresponding path program 1 times [2023-11-19 07:39:10,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:10,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152953376] [2023-11-19 07:39:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:10,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:11,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:11,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152953376] [2023-11-19 07:39:11,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152953376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:11,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:11,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:39:11,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598820159] [2023-11-19 07:39:11,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:11,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:39:11,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:11,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:39:11,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:39:11,231 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:11,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:11,421 INFO L93 Difference]: Finished difference Result 87 states and 121 transitions. [2023-11-19 07:39:11,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:39:11,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-19 07:39:11,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:11,425 INFO L225 Difference]: With dead ends: 87 [2023-11-19 07:39:11,425 INFO L226 Difference]: Without dead ends: 60 [2023-11-19 07:39:11,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:39:11,436 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 152 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:11,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 129 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:11,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-19 07:39:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2023-11-19 07:39:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2023-11-19 07:39:11,470 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 17 [2023-11-19 07:39:11,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:11,471 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2023-11-19 07:39:11,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2023-11-19 07:39:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 07:39:11,473 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:11,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:11,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:39:11,474 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:11,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:11,475 INFO L85 PathProgramCache]: Analyzing trace with hash 578177414, now seen corresponding path program 1 times [2023-11-19 07:39:11,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:11,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340916946] [2023-11-19 07:39:11,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:11,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:11,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:11,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340916946] [2023-11-19 07:39:11,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340916946] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:11,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:11,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:39:11,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776199393] [2023-11-19 07:39:11,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:11,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:39:11,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:11,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:39:11,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:39:11,840 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:12,124 INFO L93 Difference]: Finished difference Result 105 states and 145 transitions. [2023-11-19 07:39:12,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:39:12,125 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-19 07:39:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:12,127 INFO L225 Difference]: With dead ends: 105 [2023-11-19 07:39:12,127 INFO L226 Difference]: Without dead ends: 78 [2023-11-19 07:39:12,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2023-11-19 07:39:12,128 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 235 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:12,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 194 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:12,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-19 07:39:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 40. [2023-11-19 07:39:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2023-11-19 07:39:12,137 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 18 [2023-11-19 07:39:12,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:12,138 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2023-11-19 07:39:12,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,138 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2023-11-19 07:39:12,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 07:39:12,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:12,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:12,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:39:12,140 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:12,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash 185150404, now seen corresponding path program 1 times [2023-11-19 07:39:12,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:12,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836541100] [2023-11-19 07:39:12,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:12,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:12,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:12,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836541100] [2023-11-19 07:39:12,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836541100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:12,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:12,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:39:12,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476574298] [2023-11-19 07:39:12,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:12,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:39:12,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:12,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:39:12,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:39:12,500 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:12,827 INFO L93 Difference]: Finished difference Result 93 states and 128 transitions. [2023-11-19 07:39:12,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:39:12,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-19 07:39:12,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:12,829 INFO L225 Difference]: With dead ends: 93 [2023-11-19 07:39:12,829 INFO L226 Difference]: Without dead ends: 66 [2023-11-19 07:39:12,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:39:12,830 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 179 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:12,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 180 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-19 07:39:12,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 42. [2023-11-19 07:39:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2023-11-19 07:39:12,838 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 18 [2023-11-19 07:39:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:12,839 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2023-11-19 07:39:12,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,839 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2023-11-19 07:39:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 07:39:12,840 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:12,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:12,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:39:12,841 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:12,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:12,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1960157766, now seen corresponding path program 1 times [2023-11-19 07:39:12,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:12,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521594753] [2023-11-19 07:39:12,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:12,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:39:12,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:39:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:39:12,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:39:12,907 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:39:12,909 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:39:12,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:39:12,914 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:12,918 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:39:12,939 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-19 07:39:12,943 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-19 07:39:12,945 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet21 could not be translated [2023-11-19 07:39:12,947 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated [2023-11-19 07:39:12,949 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated [2023-11-19 07:39:12,950 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet24 could not be translated [2023-11-19 07:39:12,951 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-19 07:39:12,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:39:12 BoogieIcfgContainer [2023-11-19 07:39:12,962 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:39:12,963 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:39:12,963 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:39:12,963 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:39:12,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:09" (3/4) ... [2023-11-19 07:39:12,966 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:39:12,967 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:39:12,968 INFO L158 Benchmark]: Toolchain (without parser) took 4959.55ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 140.5MB in the beginning and 147.2MB in the end (delta: -6.7MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2023-11-19 07:39:12,968 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 119.5MB. Free memory was 80.1MB in the beginning and 80.0MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:39:12,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.77ms. Allocated memory is still 169.9MB. Free memory was 140.5MB in the beginning and 127.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 07:39:12,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.31ms. Allocated memory is still 169.9MB. Free memory was 127.9MB in the beginning and 124.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:39:12,969 INFO L158 Benchmark]: Boogie Preprocessor took 73.51ms. Allocated memory is still 169.9MB. Free memory was 124.3MB in the beginning and 122.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:39:12,970 INFO L158 Benchmark]: RCFGBuilder took 675.06ms. Allocated memory is still 169.9MB. Free memory was 122.1MB in the beginning and 103.3MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-19 07:39:12,970 INFO L158 Benchmark]: TraceAbstraction took 3809.97ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 102.3MB in the beginning and 147.2MB in the end (delta: -44.9MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2023-11-19 07:39:12,970 INFO L158 Benchmark]: Witness Printer took 4.55ms. Allocated memory is still 237.0MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:39:12,972 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.31ms. Allocated memory is still 119.5MB. Free memory was 80.1MB in the beginning and 80.0MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.77ms. Allocated memory is still 169.9MB. Free memory was 140.5MB in the beginning and 127.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.31ms. Allocated memory is still 169.9MB. Free memory was 127.9MB in the beginning and 124.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.51ms. Allocated memory is still 169.9MB. Free memory was 124.3MB in the beginning and 122.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 675.06ms. Allocated memory is still 169.9MB. Free memory was 122.1MB in the beginning and 103.3MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3809.97ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 102.3MB in the beginning and 147.2MB in the end (delta: -44.9MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * Witness Printer took 4.55ms. Allocated memory is still 237.0MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet24 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 21]: 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 bitwiseOr at line 98, overapproximation of bitwiseAnd at line 103. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 2); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (2 - 1); [L38] const SORT_35 mask_SORT_35 = (SORT_35)-1 >> (sizeof(SORT_35) * 8 - 12); [L39] const SORT_35 msb_SORT_35 = (SORT_35)1 << (12 - 1); [L41] const SORT_6 var_7 = 0; [L42] const SORT_12 var_14 = 0; [L43] const SORT_1 var_19 = 1; [L44] const SORT_6 var_49 = 1; [L45] const SORT_6 var_51 = 4; [L47] SORT_1 input_2; [L48] SORT_3 input_4; [L49] SORT_3 input_5; [L50] SORT_3 input_23; [L51] SORT_3 input_25; [L52] SORT_3 input_27; [L53] SORT_1 input_29; [L54] SORT_3 input_31; [L55] SORT_3 input_33; [L56] SORT_35 input_36; [L57] SORT_35 input_38; [L58] SORT_3 input_40; [L59] SORT_3 input_42; [L60] SORT_3 input_44; [L61] SORT_3 input_46; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_6 VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L63] SORT_6 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_6; [L65] SORT_6 init_9_arg_1 = var_7; [L66] state_8 = init_9_arg_1 VAL [init_9_arg_1=0, mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, state_8=0, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L69] input_2 = __VERIFIER_nondet_uchar() [L70] input_4 = __VERIFIER_nondet_ushort() [L71] input_5 = __VERIFIER_nondet_ushort() [L72] input_23 = __VERIFIER_nondet_ushort() [L73] input_25 = __VERIFIER_nondet_ushort() [L74] input_27 = __VERIFIER_nondet_ushort() [L75] input_29 = __VERIFIER_nondet_uchar() [L76] input_31 = __VERIFIER_nondet_ushort() [L77] input_33 = __VERIFIER_nondet_ushort() [L78] input_36 = __VERIFIER_nondet_ushort() [L79] input_38 = __VERIFIER_nondet_ushort() [L80] input_40 = __VERIFIER_nondet_ushort() [L81] input_42 = __VERIFIER_nondet_ushort() [L82] input_44 = __VERIFIER_nondet_ushort() [L83] input_46 = __VERIFIER_nondet_ushort() [L86] SORT_6 var_10_arg_0 = state_8; [L87] SORT_1 var_10 = var_10_arg_0 >> 2; [L88] SORT_1 var_11_arg_0 = var_10; [L89] SORT_1 var_11 = ~var_11_arg_0; [L90] SORT_6 var_13_arg_0 = state_8; [L91] SORT_12 var_13 = var_13_arg_0 >> 0; VAL [init_9_arg_1=0, mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, state_8=0, var_10=0, var_10_arg_0=0, var_11=255, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L92] EXPR var_13 & mask_SORT_12 VAL [init_9_arg_1=0, mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, state_8=0, var_10=0, var_10_arg_0=0, var_11=255, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L92] var_13 = var_13 & mask_SORT_12 [L93] SORT_12 var_15_arg_0 = var_13; [L94] SORT_12 var_15_arg_1 = var_14; [L95] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L96] SORT_1 var_16_arg_0 = var_11; [L97] SORT_1 var_16_arg_1 = var_15; VAL [init_9_arg_1=0, mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, state_8=0, var_10=0, var_10_arg_0=0, var_11=255, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_15=1, var_15_arg_0=0, var_15_arg_1=0, var_16_arg_0=255, var_16_arg_1=1, var_19=1, var_49=1, var_51=4, var_7=0] [L98] EXPR var_16_arg_0 | var_16_arg_1 VAL [init_9_arg_1=0, mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, state_8=0, var_10=0, var_10_arg_0=0, var_11=255, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_15=1, var_15_arg_0=0, var_15_arg_1=0, var_16_arg_0=255, var_16_arg_1=1, var_19=1, var_49=1, var_51=4, var_7=0] [L98] SORT_1 var_16 = var_16_arg_0 | var_16_arg_1; [L99] SORT_1 var_20_arg_0 = var_16; [L100] SORT_1 var_20 = ~var_20_arg_0; [L101] SORT_1 var_21_arg_0 = var_19; [L102] SORT_1 var_21_arg_1 = var_20; VAL [init_9_arg_1=0, mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, state_8=0, var_10=0, var_10_arg_0=0, var_11=255, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_15=1, var_15_arg_0=0, var_15_arg_1=0, var_16=0, var_16_arg_0=255, var_16_arg_1=1, var_19=1, var_20=255, var_20_arg_0=0, var_21_arg_0=1, var_21_arg_1=255, var_49=1, var_51=4, var_7=0] [L103] EXPR var_21_arg_0 & var_21_arg_1 VAL [init_9_arg_1=0, mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, state_8=0, var_10=0, var_10_arg_0=0, var_11=255, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_15=1, var_15_arg_0=0, var_15_arg_1=0, var_16=0, var_16_arg_0=255, var_16_arg_1=1, var_19=1, var_20=255, var_20_arg_0=0, var_21_arg_0=1, var_21_arg_1=255, var_49=1, var_51=4, var_7=0] [L103] SORT_1 var_21 = var_21_arg_0 & var_21_arg_1; [L104] EXPR var_21 & mask_SORT_1 VAL [init_9_arg_1=0, mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, state_8=0, var_10=0, var_10_arg_0=0, var_11=255, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_15=1, var_15_arg_0=0, var_15_arg_1=0, var_16=0, var_16_arg_0=255, var_16_arg_1=1, var_19=1, var_20=255, var_20_arg_0=0, var_21=1, var_21_arg_0=1, var_21_arg_1=255, var_49=1, var_51=4, var_7=0] [L104] var_21 = var_21 & mask_SORT_1 [L105] SORT_1 bad_22_arg_0 = var_21; [L106] CALL __VERIFIER_assert(!(bad_22_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 652 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 652 mSDsluCounter, 813 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 598 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 198 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 215 mSDtfsCounter, 198 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=6, InterpolantAutomatonStates: 47, 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, 6 MinimizatonAttempts, 111 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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 [2023-11-19 07:39:12,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu --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 64bit --witnessprinter.graph.data.programhash 7c314eef3d472fe4a1a0388d2c5f5a188709ac797267103fd11452d71371ead3 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:39:15,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:39:15,693 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-19 07:39:15,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:39:15,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:39:15,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:39:15,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:39:15,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:39:15,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:39:15,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:39:15,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:39:15,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:39:15,753 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:39:15,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:39:15,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:39:15,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:39:15,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:39:15,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:39:15,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:39:15,758 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:39:15,759 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:39:15,759 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:39:15,760 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:39:15,760 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:39:15,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:39:15,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:39:15,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:39:15,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:39:15,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:39:15,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:39:15,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:39:15,764 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:39:15,765 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:39:15,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:39:15,765 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:39:15,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:39:15,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:39:15,766 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:39:15,766 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:39:15,767 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c314eef3d472fe4a1a0388d2c5f5a188709ac797267103fd11452d71371ead3 [2023-11-19 07:39:16,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:39:16,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:39:16,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:39:16,218 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:39:16,219 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:39:16,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2023-11-19 07:39:19,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:39:19,665 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:39:19,665 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2023-11-19 07:39:19,674 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/data/9e42c0ed0/a29710c5107641c2950a6e1f115dee34/FLAGd578f9f9f [2023-11-19 07:39:19,689 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/data/9e42c0ed0/a29710c5107641c2950a6e1f115dee34 [2023-11-19 07:39:19,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:39:19,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:39:19,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:39:19,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:39:19,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:39:19,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:39:19" (1/1) ... [2023-11-19 07:39:19,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@293f6e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:19, skipping insertion in model container [2023-11-19 07:39:19,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:39:19" (1/1) ... [2023-11-19 07:39:19,751 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:39:19,910 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c[1260,1273] [2023-11-19 07:39:19,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:39:19,994 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:39:20,015 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c[1260,1273] [2023-11-19 07:39:20,064 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:39:20,090 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:39:20,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:20 WrapperNode [2023-11-19 07:39:20,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:39:20,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:39:20,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:39:20,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:39:20,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:20" (1/1) ... [2023-11-19 07:39:20,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:20" (1/1) ... [2023-11-19 07:39:20,162 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 135 [2023-11-19 07:39:20,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:39:20,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:39:20,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:39:20,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:39:20,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:20" (1/1) ... [2023-11-19 07:39:20,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:20" (1/1) ... [2023-11-19 07:39:20,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:20" (1/1) ... [2023-11-19 07:39:20,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:20" (1/1) ... [2023-11-19 07:39:20,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:20" (1/1) ... [2023-11-19 07:39:20,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:20" (1/1) ... [2023-11-19 07:39:20,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:20" (1/1) ... [2023-11-19 07:39:20,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:20" (1/1) ... [2023-11-19 07:39:20,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:39:20,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:39:20,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:39:20,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:39:20,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:20" (1/1) ... [2023-11-19 07:39:20,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:39:20,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:20,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:39:20,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:39:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:39:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:39:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:39:20,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:39:20,476 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:39:20,479 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:39:20,804 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:39:20,811 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:39:20,812 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:39:20,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:20 BoogieIcfgContainer [2023-11-19 07:39:20,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:39:20,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:39:20,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:39:20,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:39:20,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:39:19" (1/3) ... [2023-11-19 07:39:20,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be01de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:20, skipping insertion in model container [2023-11-19 07:39:20,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:20" (2/3) ... [2023-11-19 07:39:20,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be01de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:20, skipping insertion in model container [2023-11-19 07:39:20,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:20" (3/3) ... [2023-11-19 07:39:20,829 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2023-11-19 07:39:20,849 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:39:20,850 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:39:20,900 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:39:20,907 INFO L357 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, mHoare=true, 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;@4d2f95e8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:39:20,908 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:39:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:20,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 07:39:20,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:20,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:39:20,921 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:20,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:20,929 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2023-11-19 07:39:20,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:39:20,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134147247] [2023-11-19 07:39:20,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:20,949 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 [2023-11-19 07:39:20,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:39:20,952 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/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) [2023-11-19 07:39:20,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/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 [2023-11-19 07:39:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:21,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-19 07:39:21,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:21,438 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:39:21,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:39:21,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134147247] [2023-11-19 07:39:21,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134147247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:21,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:21,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:21,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305878584] [2023-11-19 07:39:21,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:21,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:21,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:39:21,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:21,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:21,502 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:21,550 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2023-11-19 07:39:21,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:21,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-19 07:39:21,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:21,560 INFO L225 Difference]: With dead ends: 19 [2023-11-19 07:39:21,561 INFO L226 Difference]: Without dead ends: 10 [2023-11-19 07:39:21,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:21,568 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:21,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-19 07:39:21,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2023-11-19 07:39:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:21,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2023-11-19 07:39:21,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2023-11-19 07:39:21,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:21,601 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2023-11-19 07:39:21,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2023-11-19 07:39:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 07:39:21,603 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:21,603 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:21,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/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 [2023-11-19 07:39:21,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/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 [2023-11-19 07:39:21,806 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:21,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:21,807 INFO L85 PathProgramCache]: Analyzing trace with hash 271073635, now seen corresponding path program 1 times [2023-11-19 07:39:21,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:39:21,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418275214] [2023-11-19 07:39:21,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:21,809 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 [2023-11-19 07:39:21,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:39:21,825 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/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) [2023-11-19 07:39:21,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/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 [2023-11-19 07:39:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:21,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-19 07:39:21,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:22,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:22,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:39:22,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418275214] [2023-11-19 07:39:22,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418275214] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:39:22,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:39:22,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-19 07:39:22,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837808224] [2023-11-19 07:39:22,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:39:22,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:39:22,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:39:22,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:39:22,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:39:22,572 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:22,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:22,892 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2023-11-19 07:39:22,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:39:22,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-19 07:39:22,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:22,894 INFO L225 Difference]: With dead ends: 18 [2023-11-19 07:39:22,894 INFO L226 Difference]: Without dead ends: 16 [2023-11-19 07:39:22,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:39:22,896 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:22,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 14 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:22,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-19 07:39:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2023-11-19 07:39:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2023-11-19 07:39:22,903 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2023-11-19 07:39:22,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:22,904 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2023-11-19 07:39:22,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2023-11-19 07:39:22,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 07:39:22,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:22,907 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2023-11-19 07:39:22,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:39:23,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/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 [2023-11-19 07:39:23,108 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:23,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:23,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1580781475, now seen corresponding path program 2 times [2023-11-19 07:39:23,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:39:23,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597336039] [2023-11-19 07:39:23,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:39:23,110 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 [2023-11-19 07:39:23,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:39:23,112 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/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) [2023-11-19 07:39:23,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/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 [2023-11-19 07:39:23,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:39:23,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:39:23,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-19 07:39:23,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:23,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:27,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:27,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:39:27,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597336039] [2023-11-19 07:39:27,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597336039] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:39:27,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:39:27,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-11-19 07:39:27,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246564297] [2023-11-19 07:39:27,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:39:27,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 07:39:27,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:39:27,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 07:39:27,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=98, Unknown=1, NotChecked=0, Total=132 [2023-11-19 07:39:27,487 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:28,097 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2023-11-19 07:39:28,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:39:28,098 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-19 07:39:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:28,098 INFO L225 Difference]: With dead ends: 21 [2023-11-19 07:39:28,098 INFO L226 Difference]: Without dead ends: 19 [2023-11-19 07:39:28,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=65, Invalid=174, Unknown=1, NotChecked=0, Total=240 [2023-11-19 07:39:28,100 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:28,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 26 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:39:28,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-19 07:39:28,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2023-11-19 07:39:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2023-11-19 07:39:28,108 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2023-11-19 07:39:28,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:28,109 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2023-11-19 07:39:28,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2023-11-19 07:39:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 07:39:28,110 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:28,110 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2023-11-19 07:39:28,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:39:28,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/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 [2023-11-19 07:39:28,313 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:28,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:28,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1250702327, now seen corresponding path program 3 times [2023-11-19 07:39:28,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:39:28,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810902885] [2023-11-19 07:39:28,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 07:39:28,315 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 [2023-11-19 07:39:28,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:39:28,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/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) [2023-11-19 07:39:28,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-19 07:39:28,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-19 07:39:28,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:39:28,431 WARN L260 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-19 07:39:28,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-19 07:39:31,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:35,995 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_12~0#1|)) (.cse5 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_14~0#1|)) (.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_6~0#1|))) (let ((.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_49~0#1|)) (.cse10 (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_7~0#1|)))))))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse30 (_ bv2 32)))))))) (.cse29 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse30)) .cse4))) .cse5))) (and (or (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_13| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse28 (_ bv0 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_13|)))))) (_ bv0 8))) .cse29) (or (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_13| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse28 (_ bv1 32)))))))))))) (_ bv0 8))) (not .cse29)))))) (.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_51~0#1|)) (.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_19~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~var_53_arg_2~0#1_12| (_ BitVec 8))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_2~0#1_12|)))))))) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse2 .cse8)))))))))) (or (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_13| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse0 (_ bv2 32))))))) (_ bv1 32)))))))))) .cse1)) (_ bv0 8))) (= .cse2 .cse3) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse0))))) .cse5)) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse2 (_ bv2 32))))))) (_ bv0 32)))))))))))))))))) (or (forall ((|v_ULTIMATE.start_main_~var_53_arg_1~0#1_12| (_ BitVec 8))) (let ((.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_1~0#1_12|)))))))) (or (not (= .cse9 .cse3)) (not (= ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse9 (_ bv2 32))))))) (_ bv0 32)))))))))))) (_ bv0 8)))))) .cse10) (or .cse10 (forall ((|v_ULTIMATE.start_main_~var_53_arg_1~0#1_12| (_ BitVec 8))) (let ((.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_1~0#1_12|)))))))) (or (not (= .cse11 .cse3)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse11))))) .cse5)) (not (= ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse11 (_ bv2 32))))))) (_ bv1 32)))))))))))) (_ bv0 8))))))) (forall ((|v_ULTIMATE.start_main_~var_53_arg_1~0#1_12| (_ BitVec 8))) (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_1~0#1_12|)))))))) (let ((.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 .cse8)))))))))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse12))))) .cse5)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse13))))) .cse5) (not (= ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse12 (_ bv2 32))))))) (_ bv1 32)))))))))))) (_ bv0 8))) (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_13| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse13 (_ bv2 32))))))) (_ bv0 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_13|)))))) (_ bv0 8))) (= .cse12 .cse3))))) (forall ((|v_ULTIMATE.start_main_~var_53_arg_2~0#1_12| (_ BitVec 8))) (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_2~0#1_12|)))))))) (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 .cse8)))))))))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse14))))) .cse5)) (not (= ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse14 (_ bv2 32))))))) (_ bv1 32)))))))))))) (_ bv0 8))) (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_13| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse15 (_ bv2 32))))))) (_ bv1 32)))))))))) .cse1)) (_ bv0 8))) (= .cse14 .cse3) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse15))))) .cse5)))))) (or .cse10 (forall ((|v_ULTIMATE.start_main_~var_53_arg_2~0#1_12| (_ BitVec 8))) (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_2~0#1_12|)))))))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse16))))) .cse5)) (not (= ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse16 (_ bv2 32))))))) (_ bv1 32)))))))))))) (_ bv0 8))) (not (= .cse16 .cse3)))))) (forall ((|v_ULTIMATE.start_main_~var_53_arg_2~0#1_12| (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_2~0#1_12|)))))))) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse17 .cse8)))))))))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse17))))) .cse5)) (not (= ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse17 (_ bv2 32))))))) (_ bv1 32)))))))))))) (_ bv0 8))) (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_13| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse18 (_ bv2 32))))))) (_ bv0 32)))))))))))))) (= .cse17 .cse3) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse18))))) .cse5))))) (forall ((|v_ULTIMATE.start_main_~var_53_arg_1~0#1_12| (_ BitVec 8))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_1~0#1_12|)))))))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 .cse8)))))))))) (or (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_13| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse19 (_ bv2 32))))))) (_ bv1 32)))))))))) .cse1)) (_ bv0 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse19))))) .cse5)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse20))))) .cse5)) (not (= ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse20 (_ bv2 32))))))) (_ bv1 32)))))))))))) (_ bv0 8))) (= .cse20 .cse3))))) (forall ((|v_ULTIMATE.start_main_~var_53_arg_2~0#1_12| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_2~0#1_12|)))))))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse8)))))))))) (or (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_13| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse21 (_ bv2 32))))))) (_ bv0 32)))))))))))))) (= .cse22 .cse3) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse21))))) .cse5) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse22 (_ bv2 32))))))) (_ bv0 32)))))))))))))))))) (forall ((|v_ULTIMATE.start_main_~var_53_arg_1~0#1_12| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_1~0#1_12|)))))))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse8)))))))))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse23))))) .cse5) (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_13| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse23 (_ bv2 32))))))) (_ bv0 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_13|)))))) (_ bv0 8))) (not (= ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse24 (_ bv2 32))))))) (_ bv0 32)))))))))))) (_ bv0 8))) (= .cse24 .cse3))))) (forall ((|v_ULTIMATE.start_main_~var_53_arg_1~0#1_12| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_1~0#1_12|)))))))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 .cse8)))))))))) (or (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_13| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse25 (_ bv2 32))))))) (_ bv1 32)))))))))) .cse1)) (_ bv0 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse25))))) .cse5)) (not (= ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse26 (_ bv2 32))))))) (_ bv0 32)))))))))))) (_ bv0 8))) (= .cse26 .cse3))))) (or .cse10 (forall ((|v_ULTIMATE.start_main_~var_53_arg_2~0#1_12| (_ BitVec 8))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_2~0#1_12|)))))))) (or (not (= .cse27 .cse3)) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse27 (_ bv2 32))))))) (_ bv0 32))))))))))))))))))))) is different from false [2023-11-19 07:39:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 15 not checked. [2023-11-19 07:39:46,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:39:46,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810902885] [2023-11-19 07:39:46,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810902885] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:39:46,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:39:46,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-19 07:39:46,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298547935] [2023-11-19 07:39:46,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:39:46,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 07:39:46,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:39:46,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 07:39:46,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2023-11-19 07:39:46,715 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:47,728 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2023-11-19 07:39:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:47,730 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-19 07:39:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:47,730 INFO L225 Difference]: With dead ends: 18 [2023-11-19 07:39:47,731 INFO L226 Difference]: Without dead ends: 0 [2023-11-19 07:39:47,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=61, Invalid=152, Unknown=1, NotChecked=26, Total=240 [2023-11-19 07:39:47,733 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:47,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:47,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-19 07:39:47,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-19 07:39:47,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-19 07:39:47,736 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2023-11-19 07:39:47,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:47,736 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 07:39:47,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-19 07:39:47,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-19 07:39:47,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:39:47,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-19 07:39:47,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/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 [2023-11-19 07:39:47,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-19 07:39:48,864 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-19 07:39:48,864 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2023-11-19 07:39:48,864 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2023-11-19 07:39:48,864 INFO L899 garLoopResultBuilder]: For program point L21-3(line 21) no Hoare annotation was computed. [2023-11-19 07:39:48,865 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-19 07:39:48,865 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 23 124) no Hoare annotation was computed. [2023-11-19 07:39:48,865 INFO L895 garLoopResultBuilder]: At program point L67-2(lines 67 122) the Hoare annotation is: (and (= (_ bv4 8) |ULTIMATE.start_main_~var_51~0#1|) (= (_ bv1 8) |ULTIMATE.start_main_~mask_SORT_1~0#1|) (= |ULTIMATE.start_main_~var_14~0#1| (_ bv0 8)) (let ((.cse0 ((_ zero_extend 24) |ULTIMATE.start_main_~state_8~0#1|))) (or (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse0 (_ bv2 32))))))) (_ bv0 32))))))) (_ bv1 32)))) (_ bv1 32))) (_ bv0 8)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv3 32))))))) (= |ULTIMATE.start_main_~var_7~0#1| (_ bv0 8)) (= (_ bv3 8) |ULTIMATE.start_main_~mask_SORT_12~0#1|) (exists ((|ULTIMATE.start_main_~var_53_arg_1~0#1| (_ BitVec 8))) (= |ULTIMATE.start_main_~state_8~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_53_arg_1~0#1|))) (_ bv7 32))))) (= (_ bv1 8) |ULTIMATE.start_main_~var_19~0#1|) (= (_ bv1 8) |ULTIMATE.start_main_~var_49~0#1|) (= (_ bv7 8) |ULTIMATE.start_main_~mask_SORT_6~0#1|)) [2023-11-19 07:39:48,866 INFO L899 garLoopResultBuilder]: For program point L67-3(lines 67 122) no Hoare annotation was computed. [2023-11-19 07:39:48,866 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-19 07:39:48,866 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-19 07:39:48,866 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2023-11-19 07:39:48,871 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-11-19 07:39:48,874 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:39:48,890 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_53_arg_1~0#1 : bv8 :: ~state_8~0 == ~bvand~32(~zero_extend~32~16(~zero_extend~32~16(ULTIMATE.start_main_~var_53_arg_1~0#1)[7:0]), 7bv32)[7:0]) could not be translated [2023-11-19 07:39:48,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:39:48 BoogieIcfgContainer [2023-11-19 07:39:48,892 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:39:48,893 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:39:48,893 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:39:48,894 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:39:48,894 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:20" (3/4) ... [2023-11-19 07:39:48,897 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 07:39:48,908 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-11-19 07:39:48,909 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-19 07:39:48,910 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-19 07:39:48,910 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 07:39:49,037 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:39:49,037 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/witness.yml [2023-11-19 07:39:49,037 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:39:49,038 INFO L158 Benchmark]: Toolchain (without parser) took 29344.99ms. Allocated memory was 107.0MB in the beginning and 188.7MB in the end (delta: 81.8MB). Free memory was 83.4MB in the beginning and 104.5MB in the end (delta: -21.1MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2023-11-19 07:39:49,039 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 77.6MB. Free memory was 54.6MB in the beginning and 54.4MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:39:49,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.52ms. Allocated memory is still 107.0MB. Free memory was 83.4MB in the beginning and 70.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 07:39:49,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.74ms. Allocated memory is still 107.0MB. Free memory was 70.5MB in the beginning and 68.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:39:49,040 INFO L158 Benchmark]: Boogie Preprocessor took 69.77ms. Allocated memory is still 107.0MB. Free memory was 68.6MB in the beginning and 67.2MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:39:49,041 INFO L158 Benchmark]: RCFGBuilder took 581.51ms. Allocated memory is still 107.0MB. Free memory was 66.9MB in the beginning and 80.4MB in the end (delta: -13.6MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2023-11-19 07:39:49,041 INFO L158 Benchmark]: TraceAbstraction took 28072.23ms. Allocated memory was 107.0MB in the beginning and 188.7MB in the end (delta: 81.8MB). Free memory was 79.6MB in the beginning and 110.8MB in the end (delta: -31.1MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2023-11-19 07:39:49,042 INFO L158 Benchmark]: Witness Printer took 144.26ms. Allocated memory is still 188.7MB. Free memory was 110.8MB in the beginning and 104.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 07:39:49,045 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.36ms. Allocated memory is still 77.6MB. Free memory was 54.6MB in the beginning and 54.4MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.52ms. Allocated memory is still 107.0MB. Free memory was 83.4MB in the beginning and 70.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.74ms. Allocated memory is still 107.0MB. Free memory was 70.5MB in the beginning and 68.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.77ms. Allocated memory is still 107.0MB. Free memory was 68.6MB in the beginning and 67.2MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 581.51ms. Allocated memory is still 107.0MB. Free memory was 66.9MB in the beginning and 80.4MB in the end (delta: -13.6MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * TraceAbstraction took 28072.23ms. Allocated memory was 107.0MB in the beginning and 188.7MB in the end (delta: 81.8MB). Free memory was 79.6MB in the beginning and 110.8MB in the end (delta: -31.1MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * Witness Printer took 144.26ms. Allocated memory is still 188.7MB. Free memory was 110.8MB in the beginning and 104.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_53_arg_1~0#1 : bv8 :: ~state_8~0 == ~bvand~32(~zero_extend~32~16(~zero_extend~32~16(ULTIMATE.start_main_~var_53_arg_1~0#1)[7:0]), 7bv32)[7:0]) could not be translated * 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.0s, OverallIterations: 4, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 14 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=3, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 6 NumberOfFragments, 71 HoareAnnotationTreeSize, 1 FomulaSimplifications, 165 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 316 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 23.5s InterpolantComputationTime, 44 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 76 ConstructedInterpolants, 32 QuantifiedInterpolants, 20558 SizeOfPredicates, 163 NumberOfNonLiveVariables, 402 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 21/86 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: (((((((((4 == var_51) && (1 == mask_SORT_1)) && (var_14 == 0)) && (((((((~((((~(((state_8 >> 2) & 127)) & 127) | 0) & 127)) & 127) & 1) & 127) & 1) & 127) == 0) || (0 == (((state_8 & 127) & 3) & 127)))) && (var_7 == 0)) && (3 == mask_SORT_12)) && (1 == var_19)) && (1 == var_49)) && (7 == mask_SORT_6)) RESULT: Ultimate proved your program to be correct! [2023-11-19 07:39:49,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93cef1b5-eaf5-46f7-af29-78ed9645b866/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE